Logic Program Schemas, Constraints and Semi-Uni cation
نویسندگان
چکیده
Program schemas are known to be useful in di erent applications such as program synthesis, transformation, analysis, debugging, teaching : : :This paper tackles two complementary aspects of program schemas. We rst propose a language for the description of program schemas. It is based on a subset of second-order logic, enhanced with constraints and speci c features of program schemas. One of the basic operations on schemas is the semi-uni cation of a schema with a program. We then express the semi-uni cation process over schemas as rewriting and reduction rules, using CLP techniques, where constraints are used to guide the semi-uni cation process.
منابع مشابه
Logic Program Schemas, Semi-Uni cation and Constraints
The use of schemas is a classical way of synthesizing, transforming and analyzing logic programs. Operations on schemas are needed, in particular, the semi-uniication of schemas with programs. Since the schemas used in the paper are second-order objects, the related semi-uniication is the second-order semi-uniication, which is decidable but NP-complete. The non-determinism implied by the NP-com...
متن کاملLogic Program Schemas, Constraints, and Semi-unification
Program schemas are known to be useful in diierent applications such as program synthesis, transformation, analysis, debugging, teaching : : : This paper tackles two complementary aspects of program schemas. We rst propose a language for the description of program schemas. It is based on a subset of second-order logic, enhanced with constraints and speciic features of program schemas. One of th...
متن کاملWhat can Knowledge Representation do for Semi-Structured Data?
The problem of modeling semi-structured data is important in many application areas such as multimedia data management, biological databases, digital libraries, and data integration. Graph schemas (Buneman et al. 1997) have been proposed recently as a simple and elegant formalism for representing semistructured data. In this model, schemas are represented as graphs whose edges are labeled with ...
متن کاملA Uni ed Constraint Model for XML
Integrity constraints are an essential part of modern schema de nition languages. They are useful for semantic speci cation, update consistency control, query optimization, etc. In this paper, we propose UCM, a model of integrity constraints for XML that is both simple and expressive. Because it relies on a single notion of keys and foreign keys, the UCMmodel is easy to use and makes formal rea...
متن کاملSet Constraints and Logic Programming
Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet They are the main ingredient in set based program analysis In this paper we describe a constraint logic programming language clp sc over set constraints in the style of Ja ar and Lassez The language subsumes ordinary logic programs over an Herbrand domain We give an e cient uni catio...
متن کامل